Matrix product-form solutions of stationary probabilities in tandem queues
نویسندگان
چکیده
منابع مشابه
Product-Form Approximation of Tandem Queues via Matrix Geometric Methods
We introduce a product-form approximation for tandem networks with Poisson arrivals and non-exponential service times. The proposed technique perturbs the model state space to match the sufficient conditions for product-form solution provided by the Reversed Compound Agent Theorem (RCAT). After characterizing the relationship between RCAT productforms and matrix geometric solutions, we develop ...
متن کاملDerivation of Product-Form Approximation for Tandem Queues via Matrix Geometric Method
We introduce a product-form approximation for tandem networks with Poisson arrivals and non-exponential service times. The proposed technique perturbates the model state space to match the sufficient conditions for product-form solution provided by the Compound Reversed Agent Theorem (RCAT). After characterizing the relation between RCAT product-forms and matrix geometric solutions, we develop ...
متن کاملMatrix Product-Form Solutions for LCFS Preemptive Service Single-Server Queues with Batch Markovian Arrival Streams
This paper considers three variants of last-come first-served (LCFS) preemptive service single-server queues, where customers are served under the LCFS preemptive resume (LCFS-PR), preemptive repeat-different (LCFS-PD), and preemptive repeat-identical (LCFS-PI) disciplines, respectively. These LCFS queues are fed by multiple batch Markovian arrival streams. Service times of customers from each ...
متن کاملOn product form tandem structures
This paper is written in honour to A. Hordijk. It establishes product form results for a generic and instructive multi-class tandem queue with blocking, to which A. Hordijk has directly and indirectly contributed. First, a sufficient and necessary product form characterization is provided. Next, three special cases are briefly presented. These illustrate the possibility of product forms despite...
متن کاملZero-automatic queues and product form
We introduce and study a new model: 0-automatic queues. Roughly, 0-automatic queues are characterized by a special buffering mechanism evolving like a random walk on some infinite group or monoid. The salient result is that all stable 0-automatic queues have a product form stationary distribution and a Poisson output process. When considering the two simplest and extremal cases of 0-automatic q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1999
ISSN: 0453-4514
DOI: 10.1016/s0453-4514(00)87112-4